Local Weighted Tree Languages
نویسندگان
چکیده
منابع مشابه
Local Weighted Tree Languages
Local weighted tree languages over semirings are introduced. For an arbitrary semiring, a weighted tree language is shown to be recognizable iff it appears as the image of a local weighted tree language under a deterministic relabeling.
متن کاملExploiting Tree Decomposition and Soft Local Consistency In Weighted CSP
Several recent approaches for processing graphical models (constraint and Bayesian networks) simultaneously exploit graph decomposition and local consistency enforcing. Graph decomposition exploits the problem structure and offers space and time complexity bounds while hard information propagation provides practical improvements of space and time behavior inside these theoretical bounds. Concur...
متن کاملWeighted Operator Precedence Languages
In the last years renewed investigation of operator precedence languages (OPL) led to discover important properties thereof: OPL are closed with respect to all major operations, are characterized, besides the original grammar family, in terms of an automata family and an MSO logic; furthermore they significantly generalize the well-known visibly pushdown languages (VPL). In another area of rese...
متن کاملSystolic Tree !-Languages
The class of !-languages recognized by systolic tree automa-ta is introduced. That class extends the class of B uchi !-languages and is closed under boolean operations. The emptiness problem for systolic tree automata on innnite sequences is decidable. A characterization of sys-tolic tree !-languages in terms of a (suitable) concatenation of ((nitary) systolic tree languages is also provided.
متن کاملResidual Tree Languages
By the Myhill-Nerode Theorem, a tree language L is recognisable if and only if ≡L has finite index. The minimal bottom-up DFTA of L is then defined using the congruence classes of ≡L as states. Exercise 1 (Bottom-up Residuals). Let L ⊆ T (F) and t ∈ T (F). The bottom-up residual of L by t is the set of all contexts C such that C[t] ∈ L: t−1L def = {C ∈ C(F) | C[t] ∈ L} . 1. Show that L is recog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2015
ISSN: 0324-721X
DOI: 10.14232/actacyb.22.2.2015.10